Codes Correcting Limited Patterns of Random Errors Using S-K Metric

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Codes Correcting Limited Patterns of Random Errors Using S-K Metric

Coding is essential in all communications and in all multi-operation devices, and errors do occur. For error control, the method in vogue is to use code words with redundant digits. The number of redundant digits is determined based on two things − the number of messages and the kind of errors that need to be controlled. For efficient coding the redundant digits have to be kept to the minimum. ...

متن کامل

Codes of Length 2 Correcting Single Errors of Limited Size

Linear codes over Zq of length 2, correcting single errors of size at most k, are considered. It is determined for which q such codes exists and explicit code constructions are given for those q. One case remains open, namely q = (k + 1)(k + 2), where k + 1 is a prime power. For this case we conjecture that no such codes exist.

متن کامل

Some codes correcting single symmetric errors of limited magnitude

An error model with symmetric errors of limited magnitude is considered. Limited magnitude means that the size of any error is limited by a number smaller (usually much smaller) than the alphabet size. Several constructions of codes correcting single error are given. In some cases, the codes are perfect or quasi-perfect.

متن کامل

On Correcting Bursts (and Random Errors) in Vector Symbol (n, k) Cyclic Codes

Simple methods are shown for correcting bursts of large size and bursts combined with random errors using vector symbols and primarily vector XOR and feedback shift register operations. One result is that any (n, k) cyclic code with minimum distance > 2 can correct all full error bursts of length n-k-1 or less if the error vectors are linearly independent. If the bursts are not full but contain...

متن کامل

On Linear Codes Correcting Random and Low-Denslty Burst Errors

This paper presents lower and upper bounds on the number of parity-check digits required for a linear code that corrects random errors and errors which are in the form of low-density bursts.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cybernetics and Information Technologies

سال: 2013

ISSN: 1314-4081,1311-9702

DOI: 10.2478/cait-2013-0004